Complexity function

Results: 282



#Item
151Automated planning and scheduling / STRIPS / FO / Constructible universe / Net / IP / Polynomial hierarchy / PSPACE / Function / Mathematics / Applied mathematics / Complexity classes

Journal of Artificial Intelligence Research[removed]432 Submitted 07/08; published[removed]The Computational Complexity of Dominance and Consistency in CP-Nets

Add to Reading List

Source URL: www.jair.org

Language: English - Date: 2008-11-25 12:36:17
152NP-complete problems / Combinatorics / Mathematical optimization / Partition problem / Heuristics / Graph theory / Heuristic function / Bin packing problem / Travelling salesman problem / Mathematics / Theoretical computer science / Computational complexity theory

Computational Intelligence, Volume ?, Number ?, 1998 ANALYSIS OF HEURISTIC FOR NUMBER PARTITIONING Ian P. Gent and Toby Walsh fipg,[removed] Department of Computer Science,

Add to Reading List

Source URL: www.cse.unsw.edu.au

Language: English - Date: 2013-07-29 02:04:54
153Mathematical logic / Constraint satisfaction / Complexity of constraint satisfaction / Function / Entailment / Envelope / Horn clause / Constraint programming / Logic / Mathematics

Tractable Set Constraints

Add to Reading List

Source URL: ijcai.org

Language: English - Date: 2011-06-29 07:09:50
154Computational complexity theory / Randomness extractor / Information theory / Finite fields / Leftover hash lemma / Entropy / XTR / Pseudorandom generator / Cryptographic hash function / Cryptography / Applied mathematics / Randomness

Overcoming Weak Expectations Yevgeniy Dodis∗ Yu Yu† December 22, 2012

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2012-12-22 10:21:59
155Procedural programming languages / Complexity classes / ALGOL 68 / Printf format string / NP / C / Vector space / Algebra / Mathematics / Computing

g05 – Random Number Generators g05tdc NAG Library Function Document nag_rand_gen_discrete (g05tdc)

Add to Reading List

Source URL: www.nag.com

Language: English - Date: 2012-01-26 06:18:39
156NP-complete problems / Approximation algorithm / Submodular set function / Shortest path problem / Bin packing problem / Vertex cover / Dominating set / Independent set / Computational complexity theory / Theoretical computer science / Graph theory / Mathematics

SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for

Add to Reading List

Source URL: siam.org

Language: English - Date: 2013-09-19 09:13:08
157Mathematical logic / Theory of computation / Recursion / Functions and mappings / Programming idioms / Primitive recursive function / ELEMENTARY / Computable function / Function / Theoretical computer science / Mathematics / Computability theory

The complexity of real recursive functions Manuel Lameiras Campagnolo D.M./I.S.A., Universidade T´ecnica de Lisboa, Tapada da Ajuda, [removed], Lisboa, Portugal; C.L.C./D.M./I.S.T., Universidade T´ecnica de Lisboa, Av.

Add to Reading List

Source URL: wslc.math.ist.utl.pt

Language: English - Date: 2003-02-11 11:10:46
158Proof theory / Functions and mappings / Logic in computer science / Function / Primitive recursive function / Curry–Howard correspondence / Second-order logic / Modal logic / Computational complexity theory / Mathematics / Logic / Mathematical logic

Extracting Feasible Programs

Add to Reading List

Source URL: aaai.org

Language: English - Date: 2006-01-11 06:16:21
159Graph / Discrete mathematics / Combinatorics / Binary relation / Emmy Noether / Model theory / Conjectures / P versus NP problem / Computational complexity theory / Mathematics / Graph theory / Function

Georgia Perimeter College Common Course Outline Course Abbreviation & Number: Math 2420

Add to Reading List

Source URL: www.gpc.edu

Language: English - Date: 2012-02-09 09:25:38
160Operations research / Convex analysis / Generalized functions / Convex optimization / Lipschitz continuity / Distribution / Convex function / Vector space / Loss function / Mathematics / Mathematical analysis / Mathematical optimization

Information-theoretic lower bounds on the oracle complexity of convex optimization Alekh Agarwal Computer Science Division UC Berkeley

Add to Reading List

Source URL: www.cs.utexas.edu

Language: English - Date: 2011-07-20 18:14:16
UPDATE